Ascending price Vickrey auctions for general valuations

نویسندگان

  • Debasis Mishra
  • David C. Parkes
چکیده

Ascending price auctions typically involve a single price path with buyers paying their final bid price. Using this traditional definition, no ascending price auction can achieve the Vickrey-Clarke-Groves (VCG) outcome for general private valuations in the combinatorial auction setting. We relax this definition by allowing discounts to buyers from the final price of the auction (or alternatively, calculating the discounts dynamically during the auction) while still maintaining a single price path. Using a notion called universal competitive equilibrium prices, shown to be necessary and sufficient to achieve the VCG outcome using ascending price auctions, we define a broad class of ascending price combinatorial auctions in which truthful bidding by buyers is an ex post Nash equilibrium. Any auction in this class achieves the VCG outcome and ex post efficiency for general valuations. We define two specific auctions in this class by generalizing two known auctions in the literature [11, 24].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ascending auctions : some impossibility results and their resolutions with final price discounts

When bidders are not substitutes, we show that there is no standard ascending auction that implements a bidder-optimal competitive equilibrium under truthful bidding. Such an impossibility holds also in environments where the Vickrey payoff vector is a competitive equilibrium payoff and is thus stronger than de Vries, Schummer and Vohra’s [On ascending Vickrey auctions for heterogeneous objects...

متن کامل

The Vickrey-Target Strategy and the Core in Ascending Combinatorial Auctions

This paper considers a general class of combinatorial auctions with ascending prices, which includes the Vickrey-Clarke-Groves mechanism and core-selecting auctions. We analyze incentives in ascending combinatorial auctions under complete and perfect information. We show that in every ascending auction, the “Vickrey-target strategy” constitutes a subgame perfect equilibrium with a restricted st...

متن کامل

Ascending Price Vickrey Auctions Using Primal-Dual Algorithms∗

The direct Vickrey-Clarke-Groves (VCG) mechanism requires solving underlying optimization problems of the main economy and of every “marginal” economy. We show that VCG outcome can be implemented using a competitive equilibrium (CE) of the main economy if and only if that CE price is also a CE price of every marginal economy. We call such a CE price a universal competitive equilibrium (UCE) pri...

متن کامل

Existence and computation of equilibria of first-price auctions with integral valuations and bids

We consider existence and computation of symmetric Pure Strategy Nash Equilibrium (PSNE) in single-item, sealedbid, first-price auctions with integral valuations and bids. For the most general case, we show that existence of PSNE is NP-hard. Then, we present algorithmic results for the case of independent valuations and two ways of breaking ties: Vickrey tie-breaking and random tie-breaking.

متن کامل

Multi-item Vickrey-Dutch auctions

Descending price auctions are adopted for goods that must be sold quickly and in private values environments, for instance in flower, fish, and tobacco auctions. In this paper, we introduce ex post efficient descending auctions for two environments: multiple non-identical items and buyers with unit-demand valuations; and multiple identical items and buyers with non-increasing marginal values. O...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Economic Theory

دوره 132  شماره 

صفحات  -

تاریخ انتشار 2007